Parking Functions and Descent Algebras
نویسنده
چکیده
We show that the notion of parkization of a word, a variant of the classical standardization, allows to introduce an internal product on the Hopf algebra of parking functions. Its Catalan subalgebra is stable under this operation and contains the descent algebra as a left ideal.
منابع مشابه
Free quasi-symmetric functions and descent algebras for wreath products, and noncommutative multi-symmetric functions
Abstract. We introduce analogs of the Hopf algebra of Free quasi-symmetric functions with bases labelled by colored permutations. When the color set is a semigroup, an internal product can be introduced. This leads to the construction of generalized descent algebras associated with wreath products Γ ≀ Sn and to the corresponding generalizations of quasi-symmetric functions. The associated Hopf ...
متن کاملFree Quasi-symmetric Functions of Arbitrary Level
We introduce analogues of the Hopf algebra of Free quasi-symmetric functions with bases labelled by colored permutations. As applications, we recover in a simple way the descent algebras associated with wreath products Γ ≀ Sn and the corresponding generalizations of quasi-symmetric functions. Finally, we obtain Hopf algebras of colored parking functions, colored non-crossing partitions and park...
متن کاملHopf Algebras and Dendriform Structures Arising from Parking Functions
We introduce a graded Hopf algebra based on the set of parking functions (hence of dimension (n + 1) in degree n). This algebra can be embedded into a noncommutative polynomial algebra in infinitely many variables. We determine its structure, and show that it admits natural quotients and subalgebras whose graded components have dimensions respectively given by the Schröder numbers (plane trees)...
متن کاملGeneralized Parking Functions, Descent Numbers, and Chain Polytopes of Ribbon Posets
We consider the inversion enumerator In(q), which counts labeled trees or, equivalently, parking functions. This polynomial has a natural extension to generalized parking functions. Substituting q = −1 into this generalized polynomial produces the number of permutations with a certain descent set. In the classical case, this result implies the formula In(−1) = En, the number of alternating perm...
متن کاملOn lifting of biadjoints and lax algebras
Given a pseudomonad $mathcal{T} $ on a $2$-category $mathfrak{B} $, if a right biadjoint $mathfrak{A}tomathfrak{B} $ has a lifting to the pseudoalgebras $mathfrak{A}tomathsf{Ps}textrm{-}mathcal{T}textrm{-}mathsf{Alg} $ then this lifting is also right biadjoint provided that $mathfrak{A} $ has codescent objects. In this paper, we give general results on lifting of biadjoints. As a consequence, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008